On Fuzzy Neighborhood Based Clustering Algorithm with Low Complexity
نویسندگان
چکیده
The main purpose of this paper is to achieve improvement in the speed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basis for fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP (NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJP algorithm would an important achievement in terms of these FJP-based methods. Although FJP has many advantages such as robustness, auto detection of the optimal number of clusters by using cluster validity, independency from scale, etc., it is a little bit slow. In order to eliminate this disadvantage, by improving the FJP algorithm, we propose a novel Modified FJP algorithm, which theoretically runs approximately n/ log2 n times faster and which is less complex than the FJP algorithm. We evaluated the performance of the Modified FJP algorithm both analytically and experimentally.
منابع مشابه
ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملBilateral Weighted Fuzzy C-Means Clustering
Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...
متن کاملLandmark FN-DBSCAN: An Efficient Density-Based Clustering Algorithm with Fuzzy Neighborhood
However, in general, the parameters of density-based clustering algorithms are usually difficult to select. So, in order to make the density-based clustering algorithms more robust, the extension with fuzzy set theory has attracted a lot of attentions recently. The fuzzy neighborhood DBSCAN (FNDBSCAN) is a typical one with this idea. But FN-DBSCAN usually requires a time complexity of O(n2) whe...
متن کاملA Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm
Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...
متن کاملInfluence of transitive closure complexity in FJP-based clustering algorithms
The difference of Fuzzy Joint Points (FJP) algorithm from other neighborhood-based clustering algorithms is that it uses the concept of fuzzy neighborhood when computing the neighborhood relations. Among the proposed methods, none of them is perfect for all aspects of clustering requirements. Although FJP algorithm has superiority by its advantages of robustness and optimal determination of the...
متن کامل